Template-Based Algorithms for Connectionist Rule Extraction
نویسندگان
چکیده
Casting neural network weights in symbolic terms is crucial for interpreting and explaining the behavior of a network. Additionally, in some domains, a symbolic description may lead to more robust generalization. We present a principled approach to symbolic rule extraction based on the notion of weight templates, parameterized regions of weight space corresponding to specific symbolic expressions. With an appropriate choice of representation, we show how template parameters may be efficiently identified and instantiated to yield the optimal match to a unit's actual weights. Depending on the requirements of the application domain, our method can accommodate arbitrary disjunctions and conjunctions with O(k) complexity, simple n-of-m expressions with O( k!) complexity, or a more general class of recursive n-of-m expressions with O(k!) complexity, where k is the number of inputs to a unit. Our method of rule extraction offers several benefits over alternative approaches in the literature, and simulation results on a variety of problems demonstrate its effectiveness.
منابع مشابه
Journal of Applied Logic Special Volume on Neural-Symbolic Systems
The past 25 years have witnessed a tremendous progress in the nature and scope of Logic and its application in Computing Science. At the same time, distributed learning systems and, in particular, Neural Networks, have been playing a central role in the development of Artificial Intelligence (AI). Notwithstanding, human beings do not use these techniques in isolation, but in an integrated way. ...
متن کاملThe Connectionist Scientist Game: Rule Extraction and Refinement in a Neural Network
Scientific induction involves an iterative process of hypothesis formulation, testing, and refinement. People in ordinary life appear to undertake a similar process in explaining their world. We believe that it is instructive to study rule induction in connectionist systems from a similar perspective. We propose an approach, called the Connectionist Scientist Game, in which symbolic condition a...
متن کاملComparative Analysis of Machine Learning Algorithms with Optimization Purposes
The field of optimization and machine learning are increasingly interplayed and optimization in different problems leads to the use of machine learning approaches. Machine learning algorithms work in reasonable computational time for specific classes of problems and have important role in extracting knowledge from large amount of data. In this paper, a methodology has been employed to opt...
متن کاملOn-line learning, reasoning, rule extraction and aggregation in locally optimized evolving fuzzy neural networks
A fuzzy neural networks are connectionist systems that facilitate learning from data, reasoning over fuzzy rules, rule insertion, rule extraction, and rule adaptation. The concept of a particular class of fuzzy neural networks, called FuNNs, is further developed in this paper to a new concept of evolving neuro-fuzzy systems (EFuNNs), with respective algorithms for learning, aggregation, rule in...
متن کامل2 Rule Extraction : Gains And
Hybrid intelligent systems that combine knowledge based and artiicial neural network systems typically have four phases involving domain knowledge representation, mapping into connectionist network, network training, and rule extraction respectively. The nal phase is important because it can provide a trained connectionist architecture with explanation power and validate its output decisions. M...
متن کامل